perm filename TITLE.TEX[106,PHY] blob sn#848175 filedate 1987-11-04 generic text, type C, neo UTF8
COMMENT āŠ—   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	A01  Case Study: A Historical Computation of Pi
C00011 ENDMK
CāŠ—;
A01  Case Study: A Historical Computation of Pi
A02  Homework: This program computes the value of pi  to 100 decimal places. 
A03  Computation by Problem Size Reduction
A04  Iterative Refinement
A05  Tournament Sorting  (for section on data structures)
A06  An algorithm may fail in four ways:
A07  Files. (Assumes Strings)
A08  The character array IMAGE[0..N+1,0..N+1] contains an image made up of 
     asterisks against a background of spaces.
A09  Numerical Precision. (Must follow section on number representation.)
A10  Floating point numbers
A11  Back-of-the-Envelope Calculation Number 18736
A12  Exercise:  (Arrays as parameters.)
A13  Exercise: ``Arithmetic'' on irrational numbers.
A14  [For section on numerical precision.]
A15  [Subjects: Programming Methodology, Invariants.]
A16  [Subject: Precision.] Testing a Numerical Algorithm
A17  Number Types
A18  [Subject: Introduction.]
A19  Got Change for a Dollar?  [RWF:  Recurrences]
A20  Successive Approximation  [ITERATIVE REFINEMENT]
A21  Case Study: Knith's Move Driver.  [assumes arrays]
A22  Sliding Blocks  (Mazlak)
A23  Exercise. (Strings)
A24  Exercise.  [Search]
A25  Symbolic Execution
A26  Example (Array)  [Incomplete]
A27  Exercise:  [Indefinite iteration, reading, programming logic.] 
A28  DRIVERS
A29  Example.  (Dynamic Programming.)
A30  Computational Geometry
A31  Exercise. The diagrams below show several orders in which a program 
     might process some of the elements of an array ...
A32  Records
A33  Algorithms (replaced by A116)
A34  Number Bases  [Assumes invariants]
A35  Subrange Types.  (See Standard Pascal, pp.\ 101--102.)
A36  Case Study: Table Searching.
A37  Final Project  The game of Battleship
A37A figure 1 for a37
A37B figure 2 for a37
A38  [Rewrite and expand. Array and subarray assignment is omitted]
     Arrays.  [RWF: Assumes subrange types] [Define subscripts or indices]
A39  [For Recurrences]
A40  Exercise (P04.PGO)
A41  Page Grids, or Don't yell out the screen door, you'll strain your voice.
A42  Representation of data in the computer---a 7-card poker hand 
A43  Exercise in Assignment and Conditional Statements.
A44  Sample Program. program PinWheel(output);
A45  Exercise: On some computers, the allowed range for negative integers
A46  Overflow and Underflow: Yo's Feet's Too Big.
A47  Appendix. Interpreting Error Messages from a Pascal Compiler.
A48  Pascal Functions and Procedures.  (Assumes type definition, blocks.)
A49  Problem.  (Science and Math Applications.)
A50  Is 1729 an interesting number?  Yes, according to Ramanujan 
A51  Sorting/Programming Economics.

A53  Rule of good programming practice.
A54  Do-It-Yourself Input/Output.  (Assumes assignment, CHAR)
A55  Type Definitions
A56  OUTPUT and output
A57  Output Format

A59  Maxima and Minima
A60  CS 106 [Dynamic Programming] Example
A61  CS 106 Final Project. A strip of paper ruled into four squares
A62  CS 106 Final Project. two pentominoes
A63  CS 106 Final Project. five square blocks `pentominoes'
A64  Recurrence
A65  Recursion
A66  Monte Carlo Methods
A67  APPENDIX B.  File Protection.
A68  Exercise: Dynamic Programming.
A69  DIV and MOD
A70  Case Study: Text Justification
A71  Final Project. The game of Chomp 
A72  APPENDIX A. Introduction to the TOPS-20 System at LOTS.
A73  Exercise in recursion.
A74  PROGRAM WORDCOUNT(INPUT,OUTPUT);
A75  Comments. A Pascal program may contain information 
A76  This program will print a table giving the ordinal values
A77  Systematic Debugging: Case Study.
A78  Numerical Precision.
A79  Significant Digits.

A81  Catch a Falling Star.  Simple Programs.
A82  repeating subalgorithms that themselves use repetition.
A83  Aliasing.
A84  Files (I). `One Man's Ceiling is Another Man's Floor'
A85  Final Project. game of Scrabble
A86  Final Project. ``wallpaper patterns'' 
A87  Appendix. Parameters of Computer ... Number Base etc.
A88  Time Bombs.  [To follow section on testing.]
A89  polynomial .. power series .. Design a program . compute . first 20 terms
A90  Types in General
A91  Divide and Conquer

A93  Appendix: Reserved Words [SWP]
A94  Problem 1. (P01,PGO)
A95  Iteration.

A97  Printing Geometrical Images.
A98  design a program to print the letter N
A99  Interactive Input

A101 Case Study: Record Breakers  [Assignment]
A102 (Assumes conditionals, assignment)

A104 Exercise. Write a program that reads two polynomials
     and prints the quotient and remainder
A105 Solution to p07.pgo
A106 Exercise. wolves-and-rabbits computation again
A107 Strings  (Assumes Arrays, CHAR, procedures)
A108 Programming Cliches
A109 Write a program that plots .. graph .. horizontal coordinate. 
A110 Cleveland Budgets Left a Mess By One Small Computer Goof
A111 Example  [While]
A112 `Many a nickle makes a muckle'
A113 Case Study: The Back of the Envelope
A114 (Variables, assignment, input) Due October 27.
A115 assignment
A116 Algorithms (replacing A33)
A117 Composition of Algorithms
A118 Generating Random Samples Without Replacement, as Sequences and Sets
A119 Let {\bf Z} be the domain of integers, ${\bf Z}↓1=2{\bf Z}+1$ the odd integers,
A120 Combining Files